package com.heima.leetcode.practice;

/**
 * leetcode 617 合并二叉树
 * @author 勾新杰
 * @version 1.0
 * @date 2024/10/29 10:33
 */
public class E617 {

    /**
     * 合并二叉树
     * @param root1 树1
     * @param root2 树2
     * @return 合并后的树
     */
    public TreeNode mergeTrees(TreeNode root1, TreeNode root2) {
        if (root1 == null && root2 == null){
            return null;
        } else if (root1 == null) {
            return root2;
        } else if (root2 == null) {
            return root1;
        } else {
            TreeNode root = new TreeNode(root1.val + root2.val);
            root.left = mergeTrees(root1.left, root2.left);
            root.right = mergeTrees(root1.right, root2.right);
            return root;
        }
    }
}
